General Parameterized Fourier Transform: A Unified Framework for the Fourier, Laplace, Mellin and $Z$ Transforms

نویسندگان

چکیده

This paper introduces Generalized Fourier transform (GFT) that is an extension or the generalization of (FT). The Unilateral Laplace (LT) observed to be special case GFT. GFT, as proposed in this work, contributes significantly scholarly literature. There are many salient contribution work. Firstly, GFT applicable a much larger class signals, some which cannot analyzed with FT and LT. For example, we have shown applicability on polynomially decaying functions super exponentials. Secondly, demonstrate efficacy solving initial value problems (IVPs). Thirdly, presented for extended other integral transforms examples wavelet cosine transform. Likewise, generalized Gamma function also presented. One interesting application computation moments, otherwise non-finite any random variable such Cauchy variable. Fourthly, introduce scale (FST) utilizes topological isomorphism exponential map. Lastly, propose Discrete-Time (GDTFT). DTFT unilateral $z$-transform cases GDTFT. properties GDTFT been discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quaternionic Fourier-Mellin Transform

In this contribution we generalize the classical Fourier Mellin transform [3], which transforms functions f representing, e.g., a gray level image defined over a compact set of R. The quaternionic Fourier Mellin transform (QFMT) applies to functions f : R → H, for which |f | is summable over R+ × S under the measure dθ dr r . R ∗ + is the multiplicative group of positive and non-zero real numbe...

متن کامل

A unified framework for the fractional Fourier transform

The paper investigates the possibility for giving a general definition of the fractional Fourier transform (FRT) for all signal classes [one-dimensional (1-D) and multidimensional, continuous and discrete, periodic and aperiodic]. Since the definition is based on the eigenfunctions of the ordinary Fourier transform (FT), the preliminary conditions is that the signal domain/periodicity be the sa...

متن کامل

Fourier Transforms and the Fast Fourier Transform ( FFT ) Algorithm

and the inverse Fourier transform is f (x) = 1 2π ∫ ∞ −∞ F(ω)e dω Recall that i = √−1 and eiθ = cos θ+ i sin θ. Think of it as a transformation into a different set of basis functions. The Fourier transform uses complex exponentials (sinusoids) of various frequencies as its basis functions. (Other transforms, such as Z, Laplace, Cosine, Wavelet, and Hartley, use different basis functions). A Fo...

متن کامل

Homography estimation using Analytical Fourier-Mellin Transform

The paper presents a registration algorithm based on the Analytical Fourier-Mellin Transform (AFMT). In the Fourier Mellin registration algorithm, the estimation of the geometrical transformation is only done in the Fourier Transform phase domain which is known by containing the shape information. The proposed algorithm will be used to estimate homography since in the vicinity of key points, we...

متن کامل

Human Activity Recognition Based on Transform and Fourier Mellin Transform

Human activity recognition is attracting a lot of attention in the computer vision domain. In this paper we present a novel human activity recognition method based on transform and Fourier Mellin Transform (FMT). Firstly, we convert the original image sequence to the Radon domain, get the transform curves by transform. Then we extract the Rotation-Scaling-Translation (RST) invariant features by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2022.3152607